Clustering and splitting charging algorithms for large scaled wireless rechargeable sensor networks

نویسندگان

  • Chi Lin
  • Guowei Wu
  • Mohammad S. Obaidat
  • Chang-Wu Yu
چکیده

As the interdiscipline of wireless communication and control engineering, the periodical charging issue in Wireless Rechargeable Sensor Networks (WRSNs) is a popular research problem. However, existing techniques for periodical charging neglect to focus on the location relationship and topological feature, leading to large charging times and long traveling time. In this paper, we develop a hybrid clustering charging algorithm (HCCA), which firstly constructs a network backbone based on a minimum connected dominating set built from the given network. Next, a hierarchical clustering algorithm which takes advantage of location relationship, is proposed to group nodes into clusters. Afterward, a K-means clustering algorithm is implemented to calculate the energy core set for realizing energy awareness. To further optimize the performance of HCCA, HCCA-TS is proposed to transform the energy charging process into a task splitting model. Tasks generated from HCCA are split into small tasks, which aim at reducing the charging time to enhance the charging efficiency. At last, simulations are carried out to demonstrate the merit of the schemes. Simulation results indicate that HCCA can enhance the performance in terms of reducing charging times, journey time and average charging time simultaneously. Moreover, HCCA-TS can further improve the performance of HCCA. © 2015 Elsevier Inc. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks

Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....

متن کامل

Multi-layer Clustering Topology Design in Densely Deployed Wireless Sensor Network using Evolutionary Algorithms

Due to the resource constraint and dynamic parameters, reducing energy consumption became the most important issues of wireless sensor networks topology design. All proposed hierarchy methods cluster a WSN in different cluster layers in one step of evolutionary algorithm usage with complicated parameters which may lead to reducing efficiency and performance. In fact, in WSNs topology, increasin...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

FDMG: Fault detection method by using genetic algorithm in clustered wireless sensor networks

Wireless sensor networks (WSNs) consist of a large number of sensor nodes which are capable of sensing different environmental phenomena and sending the collected data to the base station or Sink. Since sensor nodes are made of cheap components and are deployed in remote and uncontrolled environments, they are prone to failure; thus, maintaining a network with its proper functions even when und...

متن کامل

Target Tracking Based on Virtual Grid in Wireless Sensor Networks

One of the most important and typical application of wireless sensor networks (WSNs) is target tracking. Although target tracking, can provide benefits for large-scale WSNs and organize them into clusters but tracking a moving target in cluster-based WSNs suffers a boundary problem. The main goal of this paper was to introduce an efficient and novel mobility management protocol namely Target Tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Systems and Software

دوره 113  شماره 

صفحات  -

تاریخ انتشار 2016